Time-bounded incompressibility of compressible strings and sequences
نویسندگان
چکیده
منابع مشابه
Time-bounded incompressibility of compressible strings and sequences
For every total recursive time bound t, a constant fraction of all compressible (low Kolmogorov complexity) strings is t-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of which every initial segment of length n is compressible to log n yet t-bounded incompressible below 1 4n− log n; and there are countable infinitely many recursiv...
متن کاملOn Time-Bounded Incompressibility of Compressible Strings and Sequences
For every total recursive time bound t, a constant fraction of all compressible (low Kolmogorov complexity) strings is t-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of which every initial segment of length n is compressible to log n yet t-bounded incompressible below 1 4n − log n; and there are a countably infinite number of re...
متن کاملOn the Spaces of $lambda _{r}$-almost Convergent and $lambda _{r}$-almost Bounded Sequences
The aim of the present work is to introduce the concept of $lambda _{r}$-almost convergence of sequences. We define the spaces $fleft( lambda _{r}right) $ and $f_{0}left( lambda _{r}right) $ of $ lambda _{r}$-almost convergent and $lambda _{r}$-almost null sequences. We investigate some inclusion relations concerning those spaces with examples and we determine the $beta $- and $gamma $-duals of...
متن کاملPolynomially Bounded Sequences and Polynomial Sequences
In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we fo...
متن کاملThe Dimensions of Individual Strings and Sequences
A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary) sequence S a dimension, which is a real number dim(S) in the interval [0, 1]. Sequences that ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2009
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.06.013